Analysis of a flat Highly Parallel Geometric Multigrid Algorithm for Hierarchical Hybrid Grids
نویسندگان
چکیده
While multicore architectures are becoming usual on desktop machines, supercomputers are approaching million cores. The amount of memory and compute power on current clusters enable us e.g. to obtain a resolution of in excess (10 000)=10 degrees of freedom. However, on the downside we are forced to partition our domain into extremely many sub-problems. Portions of the algorithm that do not permit such degrees of parallelism can easily become a bottleneck. Additionally the performance analysis and debugging of programs at this scale become challenging tasks in themselves. We present scaling results of a quite flat multigrid algorithm (MG) for Hierarchical Hybrid Grids (HHG) and discuss its performance.
منابع مشابه
An Efficient Parallel Multigrid Solver for 3-D Convection-dominated Problems
Multigrid algorithms are known to be highly efficient in solving systems of elliptic equations. However, standard multigrid algorithms fail to achieve optimal grid-independent convergence rates in solving non-elliptic problems. In many practical cases, the non-elliptic part of a problem is represented by the convection operator. Downstream marching, when it is viable, is the simplest and most e...
متن کاملParallel Geometric Multigrid
Multigrid methods are among the fastest numerical algorithms for the solution of large sparse systems of linear equations. While these algorithms exhibit asymptotically optimal computational complexity, their efficient parallelisation is hampered by the poor computation-to-communication ratio on the coarse grids. Our contribution discusses parallelisation techniques for geometric multigrid meth...
متن کامل5 Parallel Geometric Multigrid
Multigrid methods are among the fastest numerical algorithms for the solution of large sparse systems of linear equations. While these algorithms exhibit asymptotically optimal computational complexity, their efficient parallelisation is hampered by the poor computation-to-communication ratio on the coarse grids. Our contribution discusses parallelisation techniques for geometric multigrid meth...
متن کاملPerformance and Scalability of Hierarchical Hybrid Multigrid Solvers for Stokes Systems
In many applications involving incompressible fluid flow, the Stokes system plays an important role. Complex flow problems may require extremely fine resolutions, easily resulting in saddle-point problems with more than a trillion (1012) unknowns. Even on the most advanced supercomputers, the fast solution of such systems of equations is a highly nontrivial and challenging task. In this work we...
متن کاملOptimizing the number of multigrid cycles in the full multigrid algorithm
Multigrid methods are among the most efficient and widespread methods for solving large linear systems of equations that arise, for example, from the discretization of partial differential equations. In this paper we introduce a new approach for optimizing the computational cost of the full multigrid method to achieve a given accuracy by determining the number of multigrid cycles on each level....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011